Randomized gathering of asynchronous mobile robots

This paper revisits the widely researched gathering problem for two robots without any agreement on coordinate system in a scenario which allows randomization asynchronous scheduling model. The scheduler is considered to be adversary determines activation schedule of robots. comes three flavors, namely, adaptive offline, online, and oblivious, based knowledge outcome random bits. follow wait-look-compute-move cycle. In this paper, we classify problems capability control parameters such as wait time, computation delay speed check feasibility terms adversarial capabilities. First, show impossibility under an offline with non-negative time delay. Gradually relaxing capabilities, present finite choices improbability infinite online adversary. Under oblivious adversary, establish possibility zero We improve runtime algorithm by restricting choose that sum more than positive constant. Finally, also extend our multiple merging.